<selfBalancingSkipList>

	selfBalancingSkipList is a data structure that is probably as fast as heapQueue, works in the same quantity and size of arrays, and is totally sorted on average at all times.

	This skipList could be doubly-linked, but only singly-linked is necessary.
	It can be traversed backward in n*log(n) time, and traversed forward in n time.

	This is about the singly-linked version:

	It has 3 arrays:
	int optimize[] //points into value[]. Changes often. Points at some flo value that could be less, could be more, probably is much more.
	int next[] //points into value[]. Points at the next highest flo value
	flo value[] //values change but indexs do not
	//int next[] contains all except 1 of the ints between 0 and next.length-1.
	//Should the highest point at the lowest to form a circle? The lowest could be found by searching for the highest.
	//int optimize[] should, on average, change to point at a higher value, so finding the highest flo is easier.

</selfBalancingSkipList>